#define _CRT_SECURE_NO_WARNINGS
#include"sort.h"
void TestInsertSort()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };
	printArr(a, sizeof(a) / sizeof(int));

	InsertSort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}

void TestShellSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0,-1,-2,-3,-3,-4,-5,-5,-6,-7,-8,-9 };
	printArr(a, sizeof(a) / sizeof(int));

	ShellSort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}

void TestSelectSort()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };
	printArr(a, sizeof(a) / sizeof(int));

	SelectSort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}

void TestHeapSort()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };
	printArr(a, sizeof(a) / sizeof(int));

	HeapSort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}

void TestBubbleSort()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };
	printArr(a, sizeof(a) / sizeof(int));

	BubbleSort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}


void TestQuickSort()
{
	//int a[] = { 6,1,2,7,9,3,4,5,10,8 };
	int a[] = { 6,1,2,6,9,3,4,6,10,8 };
	printArr(a, sizeof(a) / sizeof(int));

	PartSort3(a, 0, sizeof(a) / sizeof(int) - 1);

	printArr(a, sizeof(a) / sizeof(int));
}

void TestMergeSort()
{
	//int a[] = { 6,1,2,7,9,3,4,5,10,8 };
	int a[] = { 6,1,2,6,9,3,4,6,10,8,10,11 };
	printArr(a, sizeof(a) / sizeof(int));

	Mergesort(a, sizeof(a) / sizeof(int));

	printArr(a, sizeof(a) / sizeof(int));
}
void TestOP()
{
	srand((unsigned int)time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}

	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	//HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	PartSort3(a1, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	//MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	//BubbleSort(a7, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("BubbleSort:%d\n", end7 - begin7);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}

//int main()
//{
//	//int a[] = { 8,6,5,9,7,1,2,3,4,0 };
//	int a[] = { 3,5,1,6,2,3,3,9,4 };
//	//InsertSort(a, sizeof(a) / sizeof(a[0]));
//	//ShellSort(a, sizeof(a) / sizeof(a[0]));
//	//SelectSort(a, sizeof(a) / sizeof(a[0]));
//	//HeapSort(a, sizeof(a) / sizeof(a[0]));
//	/*BubbleSort(a, sizeof(a) / sizeof(a[0]));*/
//	//PartSort2(a, 0, (sizeof(a) / sizeof(a[0]))-1);
//	//Mergesort(a, sizeof(a) / sizeof(a[0]));
//	//Countsort(a, sizeof(a) / sizeof(a[0]));
//	MergesortR(a, sizeof(a) / sizeof(a[0]));
//	printArr(a, sizeof(a) / sizeof(a[0]));
//	return 0;
//}

int main()
{
	TestOP();
	return 0;
}